Packing chromatic number versus chromatic and clique number
نویسندگان
چکیده
منابع مشابه
Packing chromatic number versus chromatic and clique number
The packing chromatic number χρ(G) of a graphG is the smallest integer k such that the vertex set of G can be partitioned into sets Vi, i ∈ [k], where each Vi is an i-packing. In this paper, we investigate for a given triple (a, b, c) of positive integers whether there exists a graph G such that ω(G) = a, χ(G) = b, and χρ(G) = c. If so, we say that (a, b, c) is realizable. It is proved that b =...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملMinimum Clique Number, Chromatic Number, and Ramsey Numbers
Let Q(n, c) denote the minimum clique number over graphs with n vertices and chromatic number c. We investigate the asymptotics of Q(n, c) when n/c is held constant. We show that when n/c is an integer α, Q(n, c) has the same growth order as the inverse function of the Ramsey number R(α+ 1, t) (as a function of t). Furthermore, we show that if certain asymptotic properties of the Ramsey numbers...
متن کاملFractional chromatic number and circular chromatic number for distance graphs with large clique size
Let Z be the set of all integers and M a set of positive integers. The distance graph G(Z,M) generated by M is the graph with vertex set Z and in which i and j are adjacent whenever |i − j| ∈ M . Supported in part by the National Science Foundation under grant DMS 9805945. Supported in part by the National Science Council, R. O. C., under grant NSC892115-M-110-012.
متن کاملPacking Chromatic Number of Enhanced Hypercubes
The packing chromatic number χρ(G) of a graph G is the smallest integer k for which there exists a mapping π : V (G) −→ {1, 2, ..., k} such that any two vertices of color i are at distance at least i+ 1. In this paper, we compute the packing chromatic number for enhanced hypercubes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Aequationes mathematicae
سال: 2017
ISSN: 0001-9054,1420-8903
DOI: 10.1007/s00010-017-0520-9